Ramsey number of 1-subdivisions of transitive tournaments

The study of problems concerning subdivisions graphs has a rich history in extremal combinatorics. Confirming conjecture Burr and Erd?s, Alon proved 1994 that subdivided have linear Ramsey numbers. Later, Alon, Krivelevich Sudakov showed every n-vertex graph with at least ?n2 edges contains 1-subdivision the complete on c?n vertices, resolving another old Erd?s. In this paper we consider directed analogue these show tournament (2+o(1))k2 vertices transitive k vertices. This is optimal up to multiplicative factor 4 confirms Girão, Popielarz Snyder.